Kripke Incompleteness of First-order Calculi with Temporal Modalities of CTL and Near Logics
نویسندگان
چکیده
منابع مشابه
On Incompleteness of Multi-dimensional First-order Temporal Logics
In this paper we show that first-order temporal logics form a proper expressiveness hierarchy with respect to dimensionality and quantifier depth of temporal connectives. This result resolves (negatively) the open question concerning the existence of an expressively complete first-order temporal logic, even when allowing multi-dimensional temporal connectives.
متن کاملKripke Completeness of First-Order Constructive Logics with Strong Negation
This paper considers Kripke completeness of Nelson’s constructive predicate logic N3 and its several variants. N3 is an extension of intuitionistic predicate logic Int by an contructive negation operator ∼ called strong negation. The variants of N3 in consideration are by omitting the axiom A → (∼A → B), by adding the axiom of constant domain ∀x(A(x) ∨ B) → ∀xA(x) ∨ B, by adding (A → B) ∨ (B → ...
متن کاملIncompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs
It is shown that the infinite-valued first-order Gödel logic G based on the set of truth values {1/k : k ∈ ω \ {0}} ∪ {0} is not r.e. The logic G is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant domains and where the order structure of the model is linear. From this, the unaxiomatizability of Kröger’s temporal logic of programs (even of t...
متن کاملHypersequent Calculi for some Intermediate Logics with Bounded Kripke Models
In this paper we define cut-free hypersequent calculi for some intermediate logics semantically characterized by bounded Kripke models. In particular we consider the logics characterized by Kripke models of bounded width Bwk, by Kripke models of bounded cardinality Bck and by linearly ordered Kripke models of bounded cardinality Gk. The latter family of logics coincides with finite-valued Gödel...
متن کاملDecidable fragments of first-order temporal logics
In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Investigations
سال: 2015
ISSN: 2413-2713,2074-1472
DOI: 10.21146/2074-1472-2015-21-1-86-99